Feature-First Hole Filling Strategy for 3D Meshes
نویسندگان
چکیده
In this paper we introduce an efficient hole-filling strategy for 3D meshes and at the same time aesthetically recover the sharp features of the original 3D model at the hole areas. Commonly, hole filling techniques try to fill up the hole first then smooth it. Very few have tried to recover the fine features of the original model at the holes. Our hole filling technique is different from other existing techniques as features are taken as the first subject to reconstruct, which eventually drive the feature-definite surface filling process. Feature curves in the missing part are reconstructed by extending salient features of the existing parts. The hole is partitioned into several smaller and more planar sub-holes by the feature curves and then the hole-filling step are done on those sub-holes. User intervention is allowed to design features to be in desired shape. This indeed guides feature curve reconstruction wherever ambiguity exists or results are unsatisfactory. It is also very efficient as a user is interfering only with sharp features and the actual hole-filling step is dealing with only simple holes.
منابع مشابه
User-guided feature Sensitive Hole Filling for 3D Meshes
Most hole filling approaches use techniques to fill up a hole first and then to smooth it. Very few tries rebuild features on the filled surface of the original 3D model. We propose an efficient hole-filling methodology which preserves sharp features of the geometry of the original model. The main idea is that we reconstruct feature curves in the missing parts of the given mesh before filling t...
متن کاملMinimum Surface Area Based Complex Hole Filling Algorithm of 3D Mesh
Filling holes of 3D models is an important and complicated process. In this paper, we introduce a new and robust method for filling complex holes in triangular mesh models. In order to fill separate holes, the boundary edges of a hole are smoothly arranged and then locally uniform new points are added to the hole. The new points are selected by minimizing a hole filling area. The Delaunay trian...
متن کاملA Hole-Filling Algorithm for Triangular Meshes
Data obtained by scanning 3D models typically contains missing pieces and holes. These can be caused due to scanning artifacts or artifacts in the surface due to wear and tear. We provide a method based on the Moving Least Squares projection to fill holes in triangular meshes obtained during the process of surface reconstruction . Our method can be applied to holes with non-planar geometry as w...
متن کاملHole filling in 3D volumetric objects
The construction of hole filling (or hole segmentation) method for 3D volumetric images is a new challenging issue in computer science. It needs a geometrical approach since from a topological point of view 3D holes (tunnels) are not well-delimited subsets of three dimensional space. In this paper, the authors propose an original, efficient, flexible algorithm of hole filling for volumetric obj...
متن کاملFilling Holes in Triangular Meshes in Engineering
In this paper, a novel hole-filling algorithm for triangular meshes is proposed. Firstly, the hole is triangulated into a set of new triangles using modified principle of minimum angle. Then the initial patching mesh is refined according to the density of vertices on boundary edges. Finally, the patching mesh is optimized via the bilateral filter to recover missed features. Experimental results...
متن کامل